On distance-regular graphs in which neighborhoods of vertices are strongly regular

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Regular Graphs with Strongly Regular Subconstituents

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .

متن کامل

Edge-distance-regular graphs are distance-regular

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...

متن کامل

Regular Star Complements in Strongly Regular Graphs

We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50

متن کامل

Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs

Let = (X,R) be a distance-regular graph of diameter d . A parallelogram of length i is a 4-tuple xyzw consisting of vertices of such that ∂(x, y)= ∂(z,w)= 1, ∂(x, z)= i, and ∂(x,w)= ∂(y,w)= ∂(y, z)= i− 1. A subset Y of X is said to be a completely regular code if the numbers πi,j = | j (x)∩ Y | (i, j ∈ {0,1, . . . , d}) depend only on i = ∂(x,Y ) and j . A subset Y of X is said to be strongly c...

متن کامل

Strongly regular graphs

Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Doklady Mathematics

سال: 2013

ISSN: 1064-5624,1531-8362

DOI: 10.1134/s1064562413050116